Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
111	Chapter 8 Facility Location The Metric Facility Location problem was popular in operations research in the 1960s but no constant factor approximation algorithms were known untilThe discovery of these is due to LP Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2014-06-25 03:14:24
112	Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems Julia Chuzhoy ∗ Computer Science Department Technion — IIT Haifa 32000, Israel Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2008-07-08 17:50:22
113	Survey of connections between approximation algorithms and parameterized complexity Dániel Marx Tel Aviv University, Israel Operations Research Seminar, Technion, Haifa, Israel Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2010-01-19 06:09:57
114	Published in ACM TRANSACTIONS ON ALGORITHMS 2:3, The NP-Completeness Column: The Many Limits on Approximation DAVID S. JOHNSON AT&T Labs – Research, Florham Park, New Jersey Add to Reading List Source URL: davidsjohnson.net Language: English - Date: 2013-10-14 12:19:43
115	Fast Approximation and Randomized Algorithms for Diameter Sharareh Alipour∗ Bahman Kalantari† Abstract Add to Reading List Source URL: fwcg14.cse.uconn.edu Language: English - Date: 2014-10-29 21:34:21
116	Nov 28 , 2014 JOB POSTING: Postdoctoral Fellow in Approximation Algorithms The Theory Group in the Department of Computing Science at University of Alberta invites applications for two postdoctoral fellowship positions. Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2015-01-06 11:12:51
117	Approximation Algorithms for the Directed k-Tour and k-Stroll Problems MohammadHossein Bateni∗ Julia Chuzhoy† Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2013-04-18 17:53:54
118	Time Stamp Synchronization of Distributed Sensor Logs: Impossibility Results and Approximation Algorithms By THOMAS CHESTER RISTENPART B.S. (University of California DavisTHESIS Add to Reading List Source URL: rist.tech.cornell.edu Language: English - Date: 2015-07-13 21:30:16
119	SOS Lecture 2 - Max Cut and Sparsest Cut /Boaz Barak Suggested reading See Section 6.2 (pagesin electronic version) of Williamson-Shmoys book ”Design of approximation algorithms” for an overview of the Geoma Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2014-08-15 22:15:58
120	SOS Lecture 3: Sparsest cut and the ARV algorithm Boaz Barak July 1, 2014 Suggested reading Section 15.4 in the approximation algorithms book of Williamson and Shmoys (available online) for more details. See also Section Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2014-08-15 22:16:33

UPDATE